Image identification and restoration based on the expectation-maximization algorithm K. 1. Lay

نویسنده

  • Aggelos K. Katsaggelos
چکیده

CONTENTS 1. Introduction 2. Image and blur models 3. Maximum likelihood (ML) parameter identification 3.1. Formulation 3.2. Constraints on the unknown parameters 4. ML parameter identification via the expectation-maximization (EM) algorithm 4.1. The EM algorithm in the linear Gaussian case 4.2. Choices of complete data 4.2.1. {x,y} as the complete data 4.2.2. {x,v} as the complete data Abstract. In this paper, the problem of identifying the image and blur parameters and restoring a noisy blurred image is addressed. Specifying the blurring process by its point spread function (PSF), the blur identification problem is formulated as the maximum likelihood estimation (MLE) of the PSF. Modeling the original image and the additive noise as zero-mean Gaussian processes, the MLE of their covariance matrices is also computed. An iterative approach, called the EM (expectation-maximization) algorithm, is used to find the maximum likelihood estimates ofthe relevant unknown parameters. In applying the EM algorithm, the original image is chosen to be part of the complete data; its estimate is computed in the E-step of the EM iterations and represents the restored image. Two algorithms for identification/restoration, based on two different choices of complete data, are derived and compared. Simultaneous blur identification and restoration is performed by the first algorithm, while the identification of the blur results from a separate minimization in the second algorithm. Experiments with simulated and photographically blurred images are shown.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-channel Image Identiication and Restoration Using the Expectation-maximization Algorithm

Previous work has demonstrated the eeectiveness of the Expectation-Maximization algorithm to restore noisy and blurred single-channel images and simultaneously identify its blur. In addition, a general framework for processing multi-channel images using single-channel techniques has also been developed. This paper combines and extends the two approaches to the simultaneous blur identiication an...

متن کامل

Restoration of Motion Blurred Image Using Spatial Domain

In image restoration, it is nearly always assumed that the point-spread function of the degrading system, as well as the variance of the observation noise and a model of the original image, is known a priori. Since these parameters are unknown for practical images of interest, they have to be estimated from the noisy blurred images themselves. This thesis presents a maximum likelihood approach ...

متن کامل

Unsupervised Texture Image Segmentation Using MRFEM Framework

Texture image analysis is one of the most important working realms of image processing in medical sciences and industry. Up to present, different approaches have been proposed for segmentation of texture images. In this paper, we offered unsupervised texture image segmentation based on Markov Random Field (MRF) model. First, we used Gabor filter with different parameters’ (frequency, orientatio...

متن کامل

Unsupervised Texture Image Segmentation Using MRFEM Framework

Texture image analysis is one of the most important working realms of image processing in medical sciences and industry. Up to present, different approaches have been proposed for segmentation of texture images. In this paper, we offered unsupervised texture image segmentation based on Markov Random Field (MRF) model. First, we used Gabor filter with different parameters’ (frequency, orientatio...

متن کامل

Image restoration under wavelet-domain priors: an expectation-maximization approach

This paper describes an expectation-maximization (EM) algorithm for wavelet-based image restoration (deconvolution). The observed image is assumed to be a convolved (e.g., blurred) and noisy version of the original image. Regularization is achieved by using a complexity penalty/prior in the wavelet domain, taking advantage of the well known sparsity of wavelet representations. The EM algorithm ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005